Few Numerical Algorithms for Minimization Unconstrained Non Linear Functions
نویسندگان
چکیده
In this paper, we propose few numerical algorithms for minimization of unconstrained non-linear functions by using Modified homotopy perturbation method and the another new algorithm based on Modified Adomian decomposition method. Then comparative study among the seven new algorithms and Newton’s algorithm is established by means of examples.
منابع مشابه
Some Multi-step Iterative Algorithms for Minimization of Unconstrained Non Linear Functions
In this paper, we propose new iterative algorithms for minimization of unconstrained non linear functions. Then comparative study is made between new algorithms and Newton’s algorithms by means of examples.
متن کاملA NEW APPROACH TO THE SOLUTION OF SENSITIVITY MINIMIZATION IN LINEAR STATE FEEDBACK CONTROL
In this paper, it is shown that by exploiting the explicit parametric state feedback solution, it is feasible to obtain the ultimate solution to minimum sensitivity problem. A numerical algorithm for construction of a robust state feedback in eigenvalue assignment problem for a controllable linear system is presented. By using a generalized parametric vector companion form, the problem of eigen...
متن کاملAlternate Iterative Algorithms for Minimization of Non-linear Functions
Numerical Optimization algorithms presents the most effective methods in continuous optimization. It responds to the growing interest in optimization in engineering, science, and business by focusing on the methods that are best suited to practical problems. In this article, we propose some alternative iterative algorithms, with different order of convergence for minimization of non-linear func...
متن کاملOn the convergence of trust region algorithms for unconstrained minimization without derivatives
We consider iterative trust region algorithms for the unconstrained minimization of an objective function F (x), x∈R, when F is differentiable but no derivatives are available, and when each model of F is a linear or a quadratic polynomial. The models interpolate F at n+1 points, which defines them uniquely when they are linear polynomials. In the quadratic case, second derivatives of the model...
متن کاملImproved Iteratively Reweighted Least Squares for Unconstrained Smoothed 퓁q Minimization
In this paper, we first study q minimization and its associated iterative reweighted algorithm for recovering sparse vectors. Unlike most existing work, we focus on unconstrained q minimization, for which we show a few advantages on noisy measurements and/or approximately sparse vectors. Inspired by the results in [Daubechies et al., Comm. Pure Appl. Math., 63 (2010), pp. 1–38] for constrained ...
متن کامل